NIST Statistical Test Suite
نویسندگان
چکیده
The NIST Statistical Test Suite has 15 tests. The principal strategy of the NIST Statistical Test Suite is to judge statistical randomness property of random bit generating algorithms. Based on 300 to 500 different keys, the algorithm generates a series of even number of different long random sequences of n bits, n varying between 13 and 15 lacs, each of which is tested by the 15 tests. Each test has a specific statistic parameter for bit sequences under the assumption of randomness and calculates the deviation of the respective statistic parameter for the series of tested bit sequences.
منابع مشابه
Faster Randomness Testing with the NIST Statistical Test Suite
Randomness testing plays an important role in cryptography. Randomness is typically examined by batteries of statistical tests. One of the most frequently used test batteries is the NIST Statistical Test Suite. The tests of randomness should be rather fast since they usually process large volumes of data. Unfortunately, this is not the case for the NIST STS, where a complete test can take hours...
متن کاملCorrections of the NIST Statistical Test Suite for Randomness
It is well known that the NIST statistical test suite was used for the evaluation of AES candidate algorithms. We have found that the test setting of Discrete Fourier Transform test and Lempel-Ziv test of this test suite are wrong. We give four corrections of mistakes in the test settings. This suggests that re-evaluation of the test results should be needed.
متن کاملA Review Study of NIST Statistical Test Suite: Development of an indigenous Computer Package
A review study of NIST Statistical Test Suite is undertaken with a motivation to understand all its test algorithms and to write their C codes independently without looking at various sites mentioned in the NIST document. All the codes are tested with the test data given in the NIST document and excellent agreements have been found. The codes have been put together in a package executable in MS...
متن کاملA Randomness Test Based on T-Complexity
We propose a randomness test based on the T-complexity of a sequence, which can be calculated using a parsing algorithm called Tdecomposition. Recently, the Lempel-Ziv (LZ) randomness test based on LZ-complexity using the LZ78 incremental parsing was officially excluded from the NIST test suite in NIST SP 800-22. This is caused from the problem that the distribution of P-values for random seque...
متن کاملOn the Design of LIL Tests for (Pseudo) Random Generators and Some Experimental Results
Random numbers have been one of the most useful objects in statistics, computer science, cryptography, modeling, simulation, and other applications though it is very difficult to construct true randomness. Many solutions (e.g., cryptographic pseudorandom generators) have been proposed to harness or simulate randomness and many statistical testing techniques have been proposed to determine wheth...
متن کامل